Polynomial Functors and Shannon Entropy

نویسندگان

چکیده

Past work shows that one can associate a notion of Shannon entropy to Dirichlet polynomial, regarded as an empirical distribution. Indeed, be extracted from any d:Dir by two-step process, where the first step is rig homomorphism out Dir, *set* polynomials, with structure given standard addition and multiplication. In this short note, we show upgraded *functor*, when replace set polynomials *category* ordinary (Cartesian) polynomials. Cartesian case, process has three steps. The functor PolyCart -> Poly sending polynomial p (dp)y, dp derivative p. second Set x Set^op, q pair (q(1),Gamma(q)), Gamma(q)=Poly(q,y) interpreted global sections viewed bundle, q(1) its base. To make precise define what appears new distributive monoidal on which understood geometrically in terms rectangles. last step, for simply extract real number sets (A,B); it log A - B^(1/A) thought aspect ratio rectangle.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Polynomial Functors and Polynomial Monads

We study polynomial functors over locally cartesian closed categories. After setting up the basic theory, we show how polynomial functors assemble into a double category, in fact a framed bicategory. We show that the free monad on a polynomial endofunctor is polynomial. The relationship with operads and other related notions is explored. Introduction Background. Notions of polynomial functor ha...

متن کامل

Polynomial Functors and Trees

We explore the relationship between polynomial functors and trees. In the first part we characterise trees as certain polynomial functors and obtain a completely formal but at the same time conceptual and explicit construction of two categories of rooted trees, whose main properties we describe in terms of some factorisation systems. The second category is the category Ω of Moerdijk and Weiss. ...

متن کامل

Polynomial functors and opetopes

We give an elementary and direct combinatorial definition of opetopes in terms of trees, well-suited for graphical manipulation (e.g. drawings of opetopes of any dimension and basic operations like sources, target, and composition); a substantial part of the paper is constituted by drawings and example computations. To relate our definition to the classical definition, we recast the Baez-Dolan ...

متن کامل

Discrete Generalised Polynomial Functors

We study generalised polynomial functors between presheaf categories, developing their mathematical theory together with computational applications. The main theoretical contribution is the introduction of discrete generalised polynomial functors, a class that lies in between the classes of cocontinuous and finitary functors, and is closed under composition, sums, finite products, and different...

متن کامل

Shannon Entropy , Renyi Entropy , and Information

This memo contains proofs that the Shannon entropy is the limiting case of both the Renyi entropy and the Tsallis entropy, or information. These results are also confirmed experimentally. We conclude with some general observations on the utility of entropy measures. A brief summary of the origins of the concept of physical entropy are provided in an appendix.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic proceedings in theoretical computer science

سال: 2023

ISSN: ['2075-2180']

DOI: https://doi.org/10.4204/eptcs.380.19